Inductive Inference of Real Functions
نویسندگان
چکیده
منابع مشابه
On the Inductive Inference of Recursive Real-Valued Functions
We combine traditional studies of inductive inference and classical continuous mathematics to produce a study of learning real-valued functions. We consider two possible ways to model the learning by example of functions with domain and range the real numbers. The first approach considers functions as represented by computable analytic functions. The second considers arbitrary computable functi...
متن کاملProbabilistic inductive inference: a survey
Inductive inference is a recursion-theoretic theory of learning, rst developed by E. M. Gold (1967). This paper surveys developments in probabilistic inductive inference. We mainly focus on nite inference of recursive functions, since this simple paradigm has produced the most interesting (and most complex) results.
متن کاملFrequency Prediction of Functions
Prediction of functions is one of processes considered in inductive inference. There is a ”black box” with a given total function f in it. The result of the inductive inference machine F (< f(0), f(1), · · · , f(n) > ) is expected to be f(n + 1). Deterministic and probabilistic prediction of functions has been widely studied. Frequency computation is a mechanism used to combine features of dete...
متن کاملInductive Inference of Limiting Programs with Bounded Number of Mind Changes
We consider inductive inference of total recursive functions in the case, when produced hypotheses are allowed some nite number of times to change \their mind" about each value of identi able function. Such type of identi cation, which we call inductive inference of limiting programs with bounded number of mind changes, by its power lies somewhere between the traditional criteria of inductive i...
متن کاملInductive Inference of Recursive Functions: Complexity Bounds
This survey includes principal results on complexity of inductive inference for recursively enumerable classes of total recursive functions. Inductive inference is a process to find an algorithm from sample computations. In the case when the given class of functions is recursively enumerable it is easy to define a natural complexity measure for the inductive inference, namely, the worst-case mi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007